Implementation of Novel High Radix Multiplier Using KOGGE Stone Adder

ABSTARCT Higher radix values of the form _ = 2r havebeen employed traditionally for recoding of multipliers, andfor determining quotientand root-digits in iterative division and square root algorithms, usually only for quite moderatevalues of r, like 2 or 3. For fast additions, in particularfor the accumulation of many terms, generally redundantrepresentations are employed, most often binary carry-saveor borrowsave, but in a number of publications it has beensuggested to recode the addends into a higher radix. It is shownthat there are no speed advantages in doing so if the radix isa power of 2, on the contrary, there are significant savings inusing standard 4-to-2 adders, even saving half of the operations in multi-operand addition.